The labeled perfect matching in bipartite graphs
نویسندگان
چکیده
منابع مشابه
The labeled perfect matching in bipartite graphs
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V,E) with |V | = 2n vertices such that E contains a perfect matching (of size n), together with a color (or label) function L : E → {c1, . . . , cq}, the labeled perfect matching problem consists in finding a perfect matching on G that us...
متن کاملA note on the hardness results for the labeled perfect matching problems in bipartite graphs
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters 96 (2005) 81-88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based...
متن کاملPerfect Matching in Bipartite Planar Graphs is in UL
We prove that Perfect Matching in bipartite planar graphs is in UL, improving upon the previous bound of SPL (see [DKR10]) on its space complexity. We also exhibit space complexity bounds for some related problems. Summarizing, we show that, constructing: 1. a Perfect Matching in bipartite planar graphs is in UL 2. a Hall Obstacle in bipartite planar graphs is in NL; 3. an Even Perfect Matching...
متن کاملSpace Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a perfect matching or not and (2) a unique perfect matching or not, are in the logspace complexity class SPL. Since SPL is contained in the logspace counting classe...
متن کاملA New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs
The purpose of this paper is to introduce a new approach to the problem of computing perfect matchings in fast deterministic parallel time. In particular, this approach yields a new algorithm which finds a perfect matching in bipartite cubic graphs in time O log n and O n n logn processors in the arbitrary CRCW PRAM model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2005
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.06.009